A Dea- Compromise Programming Model for Comprehensive Ranking
نویسندگان
چکیده
This paper addresses comprehensive ranking systems determining an ordering of entities by aggregating quantitative data for multiple attributes. We propose a DEA-CP (Data Envelopment Analysis Compromise Programming) model for the comprehensive ranking, including preference voting (ranked voting) to rank candidates in terms of aggregate vote by rank for each candidate. Although the DEA-CP model once employs the flexible DEA weighting system that can vary by entity, it finally aims at regressing to the common weights across the entities. Therefore, the model can totally rank the entities by specifying nothing arbitrary, and can avoid to use the diverse DEA weights.
منابع مشابه
A goal programming procedure for ranking decision making units in DEA
This research proposes a methodology for ranking decision making units byusing a goal programming model.We suggest a two phases procedure. In phase1, by using some DEA problems for each pair of units, we construct a pairwisecomparison matrix. Then this matrix is utilized to rank the units via the goalprogramming model.
متن کاملA Data Envelopment Analysis Model with Triangular Intuitionistic Fuzzy Numbers
DEA (Data Envelopment Analysis) is a technique for evaluating the relative effectiveness of decision-making units (DMU) with multiple inputs and outputs data based on non-parametric modeling using mathematical programming (including linear programming, multi-parameter programming, stochastic programming, etc.). The classical DEA methods are developed to handle the information in the form of cri...
متن کاملA generalized super-efficiency model for ranking extreme efficient DMUs in stochastic DEA
In this current study a generalized super-efficiency model is first proposed for ranking extreme efficient decision making units (DMUs) in stochastic data envelopment analysis (DEA) and then, a deterministic (crisp) equivalent form of the stochastic generalized super-efficiency model is presented. It is shown that this deterministic model can be converted to a quadratic programming model. So fa...
متن کاملRanking efficient DMUs using the variation coefficient of weights in DEA
One of the difficulties of Data Envelopment Analysis(DEA) is the problem of deciency discriminationamong efficient Decision Making Units(DMUs) and hence, yielding large number of DMUs as efficientones. The main purpose of this paper is to overcome this inability. One of the methods for rankingefficient DMUs is minimizing the Coefficient of Variation (CV) for inputs-outputs weights. In this pape...
متن کاملA New Goal programming approach for cross efficiency evaluation
Cross efficiency evaluation was developed as an extension of DEA. But the traditional DEA models usually have alternative optimal solutions and, as a result, cross efficiency scores may not be unique. It is recommended that without changing the DEA efficiency scores, the secondary goal should be introduced for optimization of the inputs/outputs weights. Several reports evaluated the perfo...
متن کامل